On Effectively Indiscernible Projective Sets and the Leibniz-Mycielski Axiom

نویسندگان

چکیده

Examples of effectively indiscernible projective sets real numbers in various models set theory are presented. We prove that it is true, Miller and Laver generic extensions the constructible universe, there exists a lightface ?21 equivalence relation on all nonconstructible reals, having exactly two classes, neither one which ordinal definable, therefore classes OD-indiscernible. A similar but somewhat weaker result obtained for Silver extensions. The other main any n, starting with 2, existence pair countable disjoint OD-indiscernible sets, whose associated belongs to ?n1, does not imply such ?n1 or lower class.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Leibniz - Mycielski Axiom in Set Theory ∗

Motivated by Leibniz’s thesis on the identity of indiscernibles, Mycielski introduced a set theoretic axiom, here dubbed the Leibniz-Mycielski axiom LM, which asserts that for each pair of distinct sets x and y there exists an ordinal α exceeding the ranks of x and y, and a formula φ(v), such that (V α ,∈) satisfies φ(x) ∧ ¬φ(y) . We examine the relationship between LM and some other axioms of ...

متن کامل

Monads and sets. On Gödel, Leibniz, and the reflection principle

Gödel once offered an argument for the general reflection principle in set theory that took the form of an analogy with Leibniz’ Monadology. I discuss the mathematical and philosophical background to Gödel’s argument, reconstruct the proposed analogy in detail, and argue that it has no justificatory force. Voor Göran, in dank en vriendschap

متن کامل

The Axiom for Connected Sets

sists of the set of all ra such that EdneT. The Gödel number of Ed is, of course, d and the Gödel number of ra (i.e. of a string of l's of length w) is 2" —1. Thus A consists of all ra such that d * (2n— 1)G7V We add to (S2) : Axiom. PI —11. Production. Px — y—>Pxl — yy. P represents the set of all ordered pairs (i, j) such that 2'=j. Then we add: Production. Px — yl, Cd — y — z, Toz—^Qx. In th...

متن کامل

On the construction of effectively random sets

We present a comparatively simple way to construct MartinLöf random and rec-random sets with certain additional properties, which works by diagonalizing against appropriate martingales. Reviewing the result of Gács and Kučera, for any given set X we construct a Martin-Löf random set from which X can be decoded effectively. By a variant of the basic construction we obtain a rec-random set that i...

متن کامل

On the Lattices of Effectively Open Sets

The lattice E of c.e. sets is a popular object of study in Computability Theory [So87]. A principal fact about this lattice is the undecidability of its first-order theory Th(E). Moreover, Th(E) is known [HN98] to be m-equivalent to the first-order arithmetic Th(N) where N := (ω; +,×). The lattice E may be considered as the lattice of effectively open subsets of the discrete topological space ω...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math9141670